A Primal-Dual Variant of the IRI-IMAI Algorithm for Linear Programming

نویسنده

  • Reha H. Tütüncü
چکیده

A local acceleration method for primal-dual potential-reduction algorithms is introduced. The method developed here uses modified Newton search directions to minimize the Tanabe-Todd-Ye (TTY) potential function, and can be regarded as a primal-dual variant of the Iri-Imai algorithm based on the multiplicative analogue of Karmarkar's potential function. When iterates are close to an optimal solution, the TTY potential function has negative curvature along the generated search directions. Therefore, large reductions in the potential function can be obtained, guaranteeing polynomial and quadratic convergence to nondegenerate solutions. * Research supported in part by NSF through grant DMS-9706950.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New complexity results for the Iri-Imai method

In this paper we show that the number of main iterations required by the Iri-Imai algorithm to solve a linear programming problem is O(nL). Moreover, we show that a modification of this algorithm requires only O( √ nL) main iterations. In this modification we measure progress by means of the primal-dual potential function.

متن کامل

ABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming

 Abstract  We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...

متن کامل

Some Duality Results in Grey Linear Programming Problem

Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...

متن کامل

Some new results on semi fully fuzzy linear programming problems

There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...

متن کامل

Primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection

This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2000